Hierarchical Structure based Job Group Resource Allocation Scheduling Model
نویسندگان
چکیده
منابع مشابه
Adaptive Job Scheduling Via Predictive Job Resource Allocation
#$%&'%('! )*+! ,-./'012&3! 0,/,! ,$%$2-! )*+! ,24/,! 5.2-.! 1%-6,! 71/82+212$9! (/3%('2&3! -.%&32&3!1*%'!2&!$./!,9,$/:!%&'!7(%3:/&$%$2*&!.%&'12&3;!<'%=$2>/!(/,*0(-/!%11*-%$2*&!2,! 6&*5&! $*! =(*>2'/! $./! 71/82+212$9! &//'/'! $*! *+$%2&! +/$$/(! (/,=*&,/! $2:/,! 0&'/(! ,0-.! -*&'2$2*&,;! ?/! =(/,/&$! %! ,-./'012&3! %==(*%-.! @#ABCBDEF! 5.2-.! '/-2'/,! (/,*0(-/! %11*-%$2*&!%$!)*+!,$%($!$2:/!%&'!...
متن کاملOn-line hierarchical job scheduling on grids with admissible allocation
In this paper, we address non-preemptive online scheduling of parallel jobs on a Grid. Our Grid consists of a large number of identical processors that are divided into several machines. We consider a Grid scheduling model with two stages. At the first stage, jobs are allocated to a suitable machine, while at the second stage, local scheduling is independently applied to each machine. We discus...
متن کاملSimultaneous Job Scheduling and Resource Allocation on Parallel Machines
Most deterministic machine scheduling models assume that the processing time of a job on a machine is fixed externally and known in advance of scheduling. However, in most realistic situations, apart from the machines, it requires additional resources to process jobs, and the processing time of a job is determined internally by the amount of the resources allocated. In these situations, both th...
متن کاملResource Co-allocation Algorithms in Distributed Job Batch Scheduling
In this work, we present slot selection algorithms for job batch scheduling in distributed computing with non-dedicated resources. Jobs are parallel applications and these applications are independent. Existing approaches towards resource co-allocation and parallel job scheduling in economic models of distributed computing are based on search of time-slots in resource occupancy schedules. The s...
متن کاملResource Minimization Job Scheduling
Given a set J of jobs, where each job j is associated with release date rj , deadline dj and processing time pj , our goal is to schedule all jobs using the minimum possible number of machines. Scheduling a job j requires selecting an interval of length pj between its release date and deadline, and assigning it to a machine, with the restriction that each machine executes at most one job at any...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/20015-2002